Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties

نویسندگان

  • Ketan Mulmuley
  • Milind A. Sohoni
چکیده

In [26], henceforth referred to as Part I, we suggested an approach to the P vs. NP and related lower bound problems in complexity theory through geometric invariant theory. In particular, it reduces the arithmetic (characteristic zero) version of the NP 6⊆ P conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in a variety associated with the complexity class P . We shall call these class varieties associated with the complexity classes P and NP . This paper develops this approach further, reducing these lower bound problems– which are all nonexistence problems–to some existence problems: specifically to proving existence of obstructions to such embeddings among class varieties. It gives two results towards explicit construction of such obstructions. The first result is a generalization of the Borel-Weil theorem to a class of orbit

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Good properties of algebras of invariants and defect of linear representations

If a reductive group G acts on an algebraic variety X , then the complexity of X , or of the action, is the minimal codimension of orbits of a Borel subgroup. The concept of complexity has the origin in theory of equivariant embeddings of homogeneous spaces. It has been shown in the fundamental paper by Luna and Vust [11] that an exhaustive theory can be developed for homogeneous spaces of comp...

متن کامل

A geometric degree formula for A-discriminants and Euler obstructions of toric varieties

We give explicit formulas for the dimensions and the degrees of A-discriminant varieties introduced by Gelfand-Kapranov-Zelevinsky [16]. Our formulas can be applied also to the case where the A-discriminant varieties are higher-codimensional and their degrees are described by the geometry of the configurations A. Moreover combinatorial formulas for the Euler obstructions of general (not necessa...

متن کامل

A ug 2 00 8 A geometric degree formula for A - discriminants and Euler obstructions of toric varieties ∗

We give explicit formulas for the dimensions and the degrees of A-discriminant varieties introduced by Gelfand-Kapranov-Zelevinsky [15]. Our formulas can be applied also to the case where the A-discriminant varieties are higher-codimensional and their degrees are described by the geometry of the configurations A. Moreover combinatorial formulas for the Euler obstructions of general (not necessa...

متن کامل

Geometric complexity of embeddings in ${\mathbb R}^d$

Given a simplicial complex K , we consider several notions of geometric complexity of embeddings of K in a Euclidean space R : thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL embedding). We show that any n-complex with N simplices which topologically embeds in R , n > 2, can be PL embedded in R with refinement complexity O(e 4+ǫ ). Families of s...

متن کامل

Geometric Complexity Theory V: Efficient algorithms for Noether Normalization

We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether’s Normalization Lemma. For general explicit varieties, as formally defined in this paper, we give a randomized polynomial-time Monte Carlo algorithm for this problem. For some interesting cases of explicit varieties, we give deterministic quasi-polynomial time algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Comput.

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2008